Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

硅整流无刷发电机供电系统动态性能的研究

分析了坦克的供电系统中采用硅整流无刷发电机时的工作特点,建立了这种系统的数学模型,举例说明了计算方法,并在文章的最后进行了评价.     

空间信息栅格体系与服务聚合技术

空间信息应用中存在的数据海量、分布异构、处理复杂、计算密集等问题制约了空间数据和信息的广泛共享和应用。空间信息栅格(SIG)以Grid和WebServices技术为核心,共享并汇集地理上分布的海量空间信息资源,实现动态整合与集成。在构建开放性SIG七层应用体系的基础上,重点研究SIG服务聚合技术,基于Petri网和图论提出了一种新的服务聚合流程模型(服务/资源网),同时构建了可扩展的服务动态选择模型(SISM),实现服务聚合过程中的动态服务选择。结合国家地质调查业务应用,通过地下水资源评价应用实例对SIG的实用性和有效性进行了验证。     

振动矩形机翼非线性绕流数值研究

发展了可用于模拟包含运动边界的非定常流动的数值方法。该方法采用非结构动网格技术并构造了一种MUSCL类型有限体积格式,求解考虑了动网格效应的三维非定常Euler方程。非结构网格的变形运动由弹簧近似技术实现。用上述方法计算了作正弦振动的矩形机翼非线性绕流,计算结果与实验结果吻合,得到了流体运动与固体运动耦合的非线性流动特性。计算表明,该数值方法具有较好的精度和可靠性,完全可用于气动弹性或其他流固耦合问题的数值模拟。     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

火炮动态后坐装置有限元分析与优化

活塞缸是火炮动态后坐装置中的关键部件,其结构强度设计是整个实验装置强度设计的核心。利用I-DEAS软件,在对其进行实体建模和有限元网格划分的基础上,计算了活塞缸整体的应力应变值,得到了活塞缸工作时的应力应变图,并对其结构中应力状况恶劣的部位进行了结构优化。     

用动态模拟方法实现C程序输入变量的取值分析

程序输入变量取值范围的确定对于测试数据的选取,尤其对边界值分析,有着直接的指导作用.一般情形下,通过对源程序进行数据流和相关性分析,可实现输入变量的取值分析.但对某些有特殊取值限制要求的表达式,用静态分析方法,难以实现其输入变量的取值分析.为此,采用动态模拟的方法,对有特殊取值限制要求的表达式,进行输入变量的取值分析.实验表明,该方法是行之有效的.     

在C#中通过数据库实现树视图无级动态维护

就树视图与数据库的结合实现树视图的无级动态维护提出了一种解决方法 ,进而拓展了树视图的功能 ,使其能够得到更多的使用。     

超空泡航行体双层壳结构动力稳定性分析

针对超空泡航行体轴向受力特点,建立超空泡航行体双层壳结构有限元模型,对结构动力稳定性进行分析.数值计算表明,当壳间实肋板厚度增大或环向肋骨数量和尺寸增加时,动力失稳区域整体下移,不稳定激发频率下降,失稳区域宽度减小幅度较小;当壳间间距减小或纵向肋骨数量和尺寸增加时,双层壳结构动力不稳定激发频率上升,动力失稳区域宽度较大...     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011